Weighted ℓ1-Minimization for Sparse Recovery under Arbitrary Prior Information

نویسندگان

  • Deanna Needell
  • Rayan Saab
  • Tina Woolf
چکیده

Weighted l1-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted l1-minimization when arbitrarily many distinct weights are permitted. For example, such a setup might be used when one has multiple estimates for the support of a signal, and these estimates have varying degrees of accuracy. Our analysis yields an extension to existing works that assume only a single constant weight is used. We include numerical experiments, with both synthetic signals and real video data, that demonstrate the benefits of allowing non-uniform weights in the reconstruction procedure. Index Terms Compressed sensing, weighted l1-minimization, restricted isometry property

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovery of signals by a weighted $\ell_2/\ell_1$ minimization under arbitrary prior support information

In this paper, we introduce a weighted l2/l1 minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high order block RIP is derived to guarantee stable and robust recovery of block sparse signals via the weighted l2/l1 minimization. We then show if the accuracy of arbitrary p...

متن کامل

Weighted ℓ1 minimization for sparse recovery with prior information

In this paper we study the compressed sensing problem of recovering a sparse signal from a system of underdetermined linear equations when we have prior information about the probability of each entry of the unknown signal being nonzero. In particular, we focus on a model where the entries of the unknown vector fall into two sets, each with a different probability of being nonzero. We propose a...

متن کامل

Analyzing Weighted ℓ1 Minimization for Sparse Recovery with Nonuniform Sparse Models

In this paper we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted `1 minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted `1 minimization recovery algorithm and analyze its perfor...

متن کامل

Weighted $\ell_1$-Minimization for Sparse Recovery under Arbitrary Prior Information

Weighted l1-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted l1-minimization when arbitrarily many distinct weights are permitted. ...

متن کامل

Optimal incorporation of sparsity information by weighted ℓ1 optimization

Compressed sensing of sparse sources can be improved by incorporating prior knowledge of the source. In this paper we demonstrate a method for optimal selection of weights in weighted l1 norm minimization for a noiseless reconstruction model, and show the improvements in compression that can be achieved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1606.01295  شماره 

صفحات  -

تاریخ انتشار 2016